Search for: All records

Abstract Knowledge graphs have recently been introduced to the verification strategy field successfully representing the complexity of verification in real‐life applications. This format provides a scale‐free analysis of verification strategies compared to the more traditional verification artifacts such as requirement traceability matrices and verification matrices. Complexities can be observed visually and numerically both in terms of the problem scope and the entity interdependencies. In this paper, we retrieve verification strategy information patterns representing different aspects of verification. This is achieved by tapping into the network properties of knowledge graphs. They are dissected to detect knowledge patterns emerging from different parts of the verification artifacts. Similarities and differences between the two verification strategies are explained numerically and semantically. Seemingly unrelated requirements and verification activities are connected through indirect connections, and orthogonalities between independent requirements are analyzed. These findings validate the scalability of verification planning and assessment based on knowledge graphs.